Verifiable Multi-agent Programs

نویسندگان

  • Rafael H. Bordini
  • Michael Fisher
  • Willem Visser
  • Michael Wooldridge
چکیده

AgentSpeak is a rea tive planning language for programming autonomous agents. It has re ently been shown that model he king te hniques an be applied to the veri ation of AgentSpeak systems, through a translation to promela, the model spe i ation language for the SPIN LTL modelhe king system. In this paper, we introdu e an alternative veri ation approa h for AgentSpeak, by translating AgentSpeak to Java and then applying JPF2, a general purpose Java model he ker. The primary advantage of this approa h is that Java is the language of hoi e for most agent implementations, and the approa h is thus mu h loser to the urrent pra ti e of agent development than the promela-based approa h. We examine both alternatives by means of a pra ti al appli ation, provide a qualitative omparison between them, and identify some key issues for future resear h.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verification of GSM-Based Artifact-Centric Systems through Finite Abstraction

The GSM framework provides a methodology for the development of artifact-centric systems, an increasingly popular paradigm in service-oriented computing. In this paper we tackle the problem of verifying GSM programs in a multi-agent system setting. We provide an embedding from GSM into a suitable multi-agent systems semantics for reasoning about knowledge and time at the first-order level. Whil...

متن کامل

An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves

‎In a (t,n)-threshold secret sharing scheme‎, ‎a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together‎, ‎but no group of fewer than t participants can do‎. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao‎, ‎and the intractability of the elliptic curve discrete logar...

متن کامل

Automated Mechanism Design Using Process Algebra

This paper shows how process algebra can be used to automatically generate verifiable mechanisms for multi-agent systems wherein agents need to trust the system. We make the link between games and process models and then present an iterative algorithm allowing us to generate mechanisms as computer programs implementing given systems’ requirements, which are expressed as constraints and desirabl...

متن کامل

A Verifiable Logic-Based Agent Architecture

In this paper, we present the SCIFF platform for multi-agent systems. The platform is based on Abductive Logic Programming, with a uniform language for specifying agent policies and interaction protocols. A significant advantage of the computational logic foundation of the SCIFF framework is that the declarative specifications of agent policies and interaction protocols can be used directly, at...

متن کامل

Agent Communication Frameworks and Verification

This paper develops a general agent communication framework which allows us to define several different notions of verification and to investigate if an agent communication language is verifiable. The framework is sufficiently general to accommodate communication languages based on agents’ mental states as well as those based on social states of the multi-agent system. For this purpose an exist...

متن کامل

Relational Contracts With and Between Agents

Firms often use both objective/verifiable and subjective/non-verifiable performance measures to provide employees with effort incentives. We study a principal/multi-agent model in which a verifiable team-based performance measure and nonverifiable individual performance measures (one for each agent) are available for contracting. A problem with tying rewards to non-verifiable measures is that t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003